On the Connectivity of the Attractors of Recurrent Iterated Function Systems
نویسنده
چکیده
Iterated function systems (IFSs) were conceived in the present form by John Hutchinson [4] and popularized by Michael Barnsley [1] and are one of the most common and most general ways to generate fractals. Many of the important examples of sets and functions with special and unusual properties in analysis turn out to be fractal sets or functions whose graph are a fractal sets and a great part of them are attractors of IFSs. There is a current effort to extend the classical Hutchinson’s framework to more general spaces and infinite iterated function systems (IIFSs) or more generally to multifunction systems and to study them. A recent such extension of the IFS theory can be found in [7], where the Lipscomb’s space-which was an important example in dimension theory – can be obtained as an attractor of an IIFS defined in a very general setting. In this setting the attractor can be a closed and bounded set in contrast with the classical theory where only compact sets are considered. Although the fractal sets are defined with measure theory – being sets with noninteger Hausdorff dimension [2], [3] – it turns out that they have interesting topological properties as we can see from the above example [7]. One of the most important result in this direction is given in Theorem 1.2 below (see [11] for a proof) which states when the attractor of an IFS is a connected set. We intend to extend this result to recurrent iterated function system (see [8], [9]; see [5], [6] for a generalization of results from [8]).
منابع مشابه
Rotation number and its properties for iterated function and non-autonomous systems
The main purpose of this paper is to introduce the rotation number for non-autonomous and iterated function systems. First, we define iterated function systems and the lift of these types of systems on the unit circle. In the following, we define the rotation number and investigate the conditions of existence and uniqueness of this number for our systems. Then, the notions rotational entropy an...
متن کاملA Gradient Descent Method for a Neural Fractal Memory
It has been demonstrated that higher order recurrent neural networks exhibit an underlying fractal attractor as an artifact of their dynamics. These fractal attractors o er a very e cent mechanism to encode visual memories in a neural substrate, since even a simple twelve weight network can encode a very large set of di erent images. The main problem in this memory model, which so far has remai...
متن کاملLogic programs, iterated function systems, and recurrent radial basis function networks
Graphs of the single-step operator for first-order logic programs — displayed in the real plane — exhibit self-similar structures known from topological dynamics, i.e. they appear to be fractals, or more precisely, attractors of iterated function systems. We show that this observation can be made mathematically precise. In particular, we give conditions which ensure that those graphs coincide w...
متن کاملCollage-based Interpolation of Real-data Sets
This paper presents a recurrent fractal interpolation method (approach) for one-dimensional sets of realdata. The method explores both the local collage idea, developed originally for image compression purposes, and the basic platform for generating of non-recurrent fractal interpolation functions – attractors of iterated function systems (IFS). The characteristic feature of the developed appro...
متن کاملConstruction of recurrent fractal interpolation surfaces(RFISs) on rectangular grids
A recurrent iterated function system (RIFS) is a genaralization of an IFS and provides nonself-affine fractal sets which are closer to natural objects. In general, it’s attractor is not a continuous surface in R. A recurrent fractal interpolation surface (RFIS) is an attractor of RIFS which is a graph of bivariate continuous interpolation function. We introduce a general method of generating re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011